The Iray Light Transport Simulation and Rendering System

While ray tracing has become increasingly common and path tracing is well understood by now, a major challenge lies in crafting an easy-to-use and efficient system implementing these technologies. Following a purely physically-based paradigm while still allowing for artistic workflows, the Iray light transport simulation and rendering system allows for rendering complex scenes by the push of a button and thus makes accurate light transport simulation widely available. In this document we discuss the challenges and implementation choices that follow from our primary design decisions, demonstrating that such a rendering system can be made a practical, scalable, and efficient real-world application that has been adopted by various companies across many fields and is in use by many industry professionals today

Classroom Examples of Robustness Problems in Geometric Computations

International audienceThe algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating point arithmetic for the assumed real arithmetic may cause implementations to fail. Although this is well known, there is no comprehensive documentation of what can go wrong and why. In this extended abstract, we study a simple incremental algorithm for planar convex hulls and give examples which make the algorithm fail in all possible ways. We also show how to construct failure-examples semi-systematically and discuss the geometry of the floating point implementation of the orientation predicate. We hope that our work will be useful for teaching computational geometry. The full paper is available at http://hal.inria.fr/inria-00344310/. It contains further examples, more theory, and color pictures. We strongly recommend to read the full paper instead of this extended abstract

Subsequent Event Risk in Individuals with Established Coronary Heart Disease:Design and Rationale of the GENIUS-CHD Consortium

BACKGROUND: The "GENetIcs of sUbSequent Coronary Heart Disease" (GENIUS-CHD) consortium was established to facilitate discovery and validation of genetic variants and biomarkers for risk of subsequent CHD events, in individuals with established CHD. METHODS: The consortium currently includes 57 studies from 18 countries, recruiting 185,614 participants with either acute coronary syndrome, stable CHD or a mixture of both at baseline. All studies collected biological samples and followed-up study participants prospectively for subsequent events. RESULTS: Enrollment into the individual studies took place between 1985 to present day with duration of follow up ranging from 9 months to 15 years. Within each study, participants with CHD are predominantly of self-reported European descent (38%-100%), mostly male (44%-91%) with mean ages at recruitment ranging from 40 to 75 years. Initial feasibility analyses, using a federated analysis approach, yielded expected associations between age (HR 1.15 95% CI 1.14-1.16) per 5-year increase, male sex (HR 1.17, 95% CI 1.13-1.21) and smoking (HR 1.43, 95% CI 1.35-1.51) with risk of subsequent CHD death or myocardial infarction, and differing associations with other individual and composite cardiovascular endpoints. CONCLUSIONS: GENIUS-CHD is a global collaboration seeking to elucidate genetic and non-genetic determinants of subsequent event risk in individuals with established CHD, in order to improve residual risk prediction and identify novel drug targets for secondary prevention. Initial analyses demonstrate the feasibility and reliability of a federated analysis approach. The consortium now plans to initiate and test novel hypotheses as well as supporting replication and validation analyses for other investigators

A Classification Scheme of 3D Interaction Techniques

An enhanced classification scheme is described, capable to provide accurate analysis of 3D interaction techniques. It is based on examples found in the literature and summarized here in a review. The feature space of the scheme has proven to be useful in analysing particular subjects of their behavior and in deriving new interaction techniques. Several interaction techniques for the rotation task are analyzed using Fitts' law to predict their performance. The treatment specializes on 2D input devices, but several results are easily generalizable to higher dimensional input devices. *Freie Universitat Berlin, Graduiertenkolleg "Algorithmische Diskrete Mathematik", Takustr. 9, 14195 Berlin, E-mail: [email protected]. Supported by the Deutsche Forschungsgemeinschaft under grant We 1265/2-1. 2 1 Introduction We need two definitions to clarify terminology for the rest of the text: Definition 1 (interaction task): An interaction task is what a user wants to do (e.g. translating, r..

Using Generic Programming for Designing a Data Structure for Polyhedral Surfaces

Appeared in Computational Geometry -- Theory and Applications 13, 1999, 65-90. Software design solutions are presented for combinatorial data structures, such as polyhedral surfaces and planar maps, tailored for program libraries in computational geometry. Design issues considered are flexibility, time and space efficiency, and ease-of-use. We focus on topological aspects of polyhedral surfaces and evaluate edge-based representations with respect to our design goals. A design for polyhedral surfaces in a halfedge data structure is developed following the generic programming paradigm known from the Standard Template Library STL for C++. Connections are shown to planar maps and face-based structures. Key words: Library design; Generic programming; Combinatorial data structure; Polyhedral surface; Halfedge data structure 1 Introduction Combinatorial structures, such as planar maps, are fundamental in computational geometry. In order to be useful in practice, a solid library for compu..

Designing a Data Structure for Polyhedral Surfaces

Design solutions for a program library are presented for combinatorial data structures in computational geometry, such as planar maps and polyhedral surfaces. Design issues considered are genericity, flexibility, time and space efficiency, and ease-of-use. We focus on topological aspects of polyhedral surfaces. Edge-based representations for polyhedrons are evaluated with respect to the design goals. A design for polyhedral surfaces in a halfedge data structure is developed following the generic programming paradigm known from the Standard Template Library STL for C++. Connections are shown to planar maps and face-based structures managing holes in facets. 1 Introduction Combinatorial structures, such as planar maps, are fundamental in computational geometry. In order to use computational geometry in practice, a solid library must provide generic and flexible solutions as one of its fundamental cornerstones. Other design criteria are time and space efficiency. Ease-of-use is necessar..